Uncertainty of Reconstruction With List-Decoding From Uniform-Tandem-Duplication Noise

We propose a list-decoding scheme for reconstruction codes in the context of uniform-tandem-duplication noise, which can be viewed as an application associative memory model to this setting. find uncertainty associated with $m>2$ strings (where previous paper considered $m=2$) asymptotic terms, where code-words are taken from error-correcting code. Thus, we trade-off between design minimum distance, number errors, acceptable list size and resulting uncertainty, corresponds required distinct retrieved outputs successful reconstruction. It is therefore seen that by accepting one may decrease coding redundancy, or reads, both.